Exponential transient length generated by a neuronal recurrence equation
نویسندگان
چکیده
منابع مشابه
Ideals Generated by Exponential-Polynomials
In several problems in Harmonic Analysis, .and in Number Theory as well, lemmas on small values of holomorphic functions play an important role. Let us give first an example from Harmonic Analysis. distributions with compact support in 17% " whose Fourier transforms satisfy, in C " , a lower estimate of the form (0.2) with v, ,..., v, also distributions with compact support 131, 33). In many ex...
متن کاملStudy of All the Periods of a Neuronal Recurrence Equation
We characterize the structure of the periods of a neuronal recurrence equation. Firstly, we give a characterization of k-chains in 0-1 periodic sequences. Secondly, we characterize the periods of all cycles of some neuronal recurrence equation. Thirdly, we explain how these results can be used to deduce the existence of the generalized period-halving bifurcation.
متن کاملGeneralized Period-halving Bifurcation of a Neuronal Recurrence Equation
We study the sequences generated by neuronal recurrence equations of the form x(n) = 1[ ∑h j=1 ajx(n − j) − θ]. From a neuronal recurrence equation of memory size h which describes a cycle of length ρ(m)× lcm(p0, p1, . . . , p−1+ρ(m)), we construct a set of ρ(m) neuronal recurrence equations whose dynamics describe respectively the transient of length O(ρ(m)×lcm(p0, . . . , pd)) and the cycle o...
متن کاملPeriod-Halving Bifurcation of a Neuronal Recurrence Equation
The sequences generated by neuronal recurrence equations of the form xHnL ! 1A⁄j!1 h aj xHn jL qE are studied. From a neuronal recurrence equation of memory size h that describes a cycle of length rHmLä lcmIp0, p1, ... , p-1+r HmLM, a set of rHmL neuronal recurrence equations is constructed with dynamics that describe respectively the transient of length OHrHmLä lcmHp0, ... , pdLL and the cycle...
متن کاملExponential Period of Neuronal Recurrence Automata with Excitatory Memory
The sequences generated by a neuronal recurrence equation with memory of the form x(n) 1[ h i1 a i x(n i) Θ], where h is the size of the memory, are studied. It is shown that in the case where all the parameters (a i) 1ih are positive reals, there exists a neuronal recurrence equation of memory length h that generates a sequence of period (e 3 h(ln(h)) 2). This result shows that in the case whe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00343-8